Minimum enclosing area triangle with a fixed angle
نویسندگان
چکیده
Given a set S of n points in the plane and a fixed angle 0 < ω < π, we show how to find all triangles of minimum area with angle ω that enclose S in O(n log n) time.
منابع مشابه
Isoperimetric Triangular Enclosure with a Fixed Angle
Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n) time, a triangle T with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter P and one fixed angle ω. We show that a similar approach can be used to compute a triangle T with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area ...
متن کاملMinimum-area enclosing triangle with a fixed angle
Given a set S of n points in the plane and a fixed angle 0 < ω < π, we show how to find all triangles of minimum area with angle ω that enclose S in O(n log n) time. We also demonstrate that in general, the solution cannot be written without cubic root.
متن کاملOn computing enclosing isosceles triangles and related problems
Given a set of points in 2 or 3 dimensions, the problem of computing a geometric structure enclosing the point set while optimizing some criteria of the enclosing structure such as area, perimeter, surface area or volume has been widely studied in the literature [1, 2, 9, 7, 11, 16, 3, 5, 4, 6, 17, 14, 18]. In this paper, we are particularly interested in the 2 dimensional setting where the enc...
متن کاملEnclosing Isosceles Triangles and Related Problems ∗
Received (received date) Revised (revised date) Communicated by (Name) Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional version of the problem where we enclose a point set with a cone of fixed apex angle α.
متن کاملOn implementation of the minimal perimeter triangle enclosing a convex polygon algorithm
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work. However, that implementation is incomplete and omits certain common cases. This note’s contribution consist of a modern treatment of the algorithm and its conseq...
متن کامل